A primal DPG method without a first-order reformulation
نویسندگان
چکیده
We show that it is possible to apply the DPG methodology without reformulating a second order boundary value problem into a first order system, by considering the simple example of the Poisson equation. The result is a new weak formulation and a new DPG method for the Poisson equation, which has no numerical trace variable, but has a numerical flux approximation on the element interfaces, in addition to the primal interior variable.
منابع مشابه
Primal-dual first-order methods for a class of cone programming
In this paper we study primal-dual first-order methods for a class of cone programming problems. In particular, we first present four natural primal-dual smooth convex minimization reformulations for them, and then discuss first-order methods, especially a variant of Nesterov’s smooth (VNS) method [2] for solving these reformulations. The associated worst-case major arithmetic operation costs o...
متن کامل"Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods
We present a framework for designing and analyzing primal-dual interior-point methods for convex optimization. We assume that a self-concordant barrier for the convex domain of interest and the Legendre transformation of the barrier are both available to us. We directly apply the theory and techniques of interior-point methods to the given good formulation of the problem (as is, without a conic...
متن کاملAn inexact block-decomposition method for extra large-scale conic semidefinite programming
In this paper, we present an inexact block-decomposition (BD) first-order method for solving standard form conic semidefinite programming (SDP) which avoids computations of exact projections onto the manifold defined by the affine constraints and, as a result, is able to handle extra large SDP instances. The method is based on a two-block reformulation of the optimality conditions where the fir...
متن کاملLagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound
In this work, we present a Lagrangean relaxation of the hull-reformulation of discrete-continuous optimization problems formulated as linear generalized disjunctive programs (GDP). The proposed Lagrangean relaxation has three important properties. The first property is that it can be applied to any linear GDP. The second property is that the solution to its continuous relaxation always yields 0...
متن کاملDegree and wavenumber [in]dependence of Schwarz preconditioner for the DPG method
This note describes an implementation of a discontinuous Petrov Galerkin (DPG) method for acoustic waves within the framework of high order finite elements provided by the software package NGSolve. A technique to impose the impedance boundary condition weakly is indicated. Numerical results from this implementation show that a multiplicative Schwarz algorithm, with no coarse solve, provides a p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Mathematics with Applications
دوره 66 شماره
صفحات -
تاریخ انتشار 2013